منابع مشابه
Signed (b, k)-Edge Covers in Graphs
Let be a simple graph with vertex set and edge set . Let have at least vertices of degree at least , where and b are positive integers. A function is said to be a signed -edge cover of G if G ( ) V G ( ) e E v ( ) E G G : ( f E k b k ) { 1,1} G ( , ) b k ( ) f e b for at least vertices of , where . The value k v G ( ) = {uv E( ( ) E v G u N v ) | } ( ) min ( ) G e E f e , taki...
متن کاملSigned B-edge Covers of Graphs
We study a signed variant of edge covers of graphs. Let b be a positive integer, and let G be a graph with minimum degree at least b. A signed b-edge cover of G is a function f : E(G) → {−1, 1} satisfying e∈EG(v) f(e) ≥ b for every v ∈ V (G). The minimum of the values of e∈E(G) f(e), taken over all signed b-edge covers f of G, is called the signed b-edge cover number and is denoted by ρb(G). Fo...
متن کاملOn the signed Roman edge k-domination in graphs
Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...
متن کاملSigned edge majority domination numbers in graphs
The open neighborhood NG(e) of an edge e in a graph G is the set consisting of all edges having a common end-vertex with e and its closed neighborhood is NG[e] = NG(e) ∪ {e}. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If ∑x∈NG[e] f(x) ≥ 1 for at least a half of the edges e ∈ E(G), then f is called a signed edge majority dominating function of G. The minimum of the val...
متن کاملSigned edge k-subdomination numbers in graphs
The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a signed edge k-subdominating function of G. The minimum of the values ∑ e∈E(G) f(e), taken over all signed edge k-subdomina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Intelligent Information Management
سال: 2010
ISSN: 2160-5912,2160-5920
DOI: 10.4236/iim.2010.22017